Long module skew codes are good
نویسندگان
چکیده
Module skew codes are one sidedmodules for (a quotient of) a skewpolynomial ringwhere multiplication is twisted by an automorphism of the Galois group of the alphabet field. We prove that long module skew codes over a fixed finite field are asymptotically good by using a non-constructive counting argument. We show that for fixed alphabet size, and automorphism order and large length their asymptotic rate and relative distance satisfy a modified Varshamov–Gilbert bound. © 2016 Elsevier B.V. All rights reserved.
منابع مشابه
On skew Armendariz and skew quasi-Armendariz modules
Let $alpha$ be an endomorphism and $delta$ an $alpha$-derivationof a ring $R$. In this paper we study the relationship between an$R$-module $M_R$ and the general polynomial module $M[x]$ over theskew polynomial ring $R[x;alpha,delta]$. We introduce the notionsof skew-Armendariz modules and skew quasi-Armendariz modules whichare generalizations of $alpha$-Armendariz modules and extend thecla...
متن کاملLinear codes using skew polynomials with automorphisms and derivations
In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gab...
متن کاملSome properties of skew codes over finite fields
After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of their main algebraic and geometric properties. Finally, for module skew codes constructed only with an automorphism, we give some BCH type lower bounds for their...
متن کاملA Note on the Dual Codes of Module Skew Codes
In [4], starting from an automorphism θ of a finite field Fq and a skew polynomial ring R = Fq[X; θ], module θ-codes are defined as left R-submodules of R/Rf where f ∈ R. In [4] it is conjectured that an Euclidean self-dual module θ-code is a θ-constacyclic code and a proof is given in the special case when the order of θ divides the length of the code. In this paper we prove that this conjectu...
متن کامل2-D skew constacyclic codes over R[x, y; ρ, θ]
For a finite field $mathbb{F}_q$, the bivariate skew polynomial ring $mathbb{F}_q[x,y;rho,theta]$ has been used to study codes cite{XH}. In this paper, we give some characterizations of the ring $R[x,y;rho,theta]$, where $R$ is a commutative ring. We investigate 2-D skew $(lambda_1,lambda_2)$-constacyclic codes in the ring $R[x,y;rho,theta]/langle x^l-lambda_1,y^s-lambda_2rangle_{mathit{l}}.$ A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016